Papers with query complexity
HotelQuEST: Balancing Quality and Efficiency in Agentic Search (2026.eacl-industry)
Copied to clipboard
| Challenge: | Existing benchmarks for agentic search focus primarily on answer quality, overlooking efficiency factors that are critical for real-world deployment. |
| Approach: | They propose a benchmark for hotel search queries that includes 214 hotel query queries that range from simple factual requests to complex queries. |
| Outcome: | The proposed benchmarks show that LLM-based agents achieve higher accuracy than traditional retrievers, but at substantially higher costs due to redundant tool calls and suboptimal routing that fails to match query complexity to model capability. |
Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing graph neural networks (GNNs) adopt rigid, query-agnostic path-exploration strategies limiting their ability to adapt to diverse linguistic contexts and semantic nuances. |
| Approach: | They propose a mixture-of-experts framework that personalizes path exploration . framework uses length experts that adaptively selects and weights candidate paths . it also uses pruning experts that evaluates candidate path from a complementary perspective . |
| Outcome: | The proposed framework shows superior performance on a diverse benchmark . it uses a mixture of experts that weights and selects path lengths according to query complexity . |
“Yes, My LoRD.” Guiding Language Model Extraction with Locality Reinforced Distillation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for model extraction attacks on large language models are inadequate . existing methods neglect the inconsistency between training tasks and LLM alignment . |
| Approach: | They propose a model extraction algorithm that uses a policy-gradient-style training task to guide the crafting of preference for the local model. |
| Outcome: | The proposed algorithm reduces query complexity while mitigating watermark protection . it can extract various state-of-the-art commercial LLMs while minimizing query complexity . |
Active Imitation Learning with Noisy Guidance (2020.acl-main)
Copied to clipboard
| Challenge: | Structured prediction methods learn models to map inputs to complex outputs with internal dependencies. |
| Approach: | They propose an algorithm that mimics an expert's choice at any queried state . they apply LEAQI to three sequence labelling tasks to reduce query costs . |
| Outcome: | The proposed algorithm shows better accuracies over a passive approach. |
Zer0-Jack: A memory-efficient gradient-based jailbreaking method for black box Multi-modal Large Language Models (2026.eacl-long)
Copied to clipboard
| Challenge: | Multi-modal large language models are highly vulnerable to jailbreak attacks due to their additional modality. |
| Approach: | They propose a black-box jailbreak framework based on zeroth-order optimization . they propose generating malicious images and patch-wise block coordinate descent . |
| Outcome: | The proposed framework achieves 98.2% success on MiniGPT-4 and 95% on the Harmful Behaviors Multi-modal dataset while jailbreaking commercial models such as GPT-4o. |
MBA-RAG: a Bandit Approach for Adaptive Retrieval-Augmented Generation through Question Complexity (2025.coling-main)
Copied to clipboard
| Challenge: | Existing RAG frameworks either indiscriminately perform retrieval or rely on rigid single-label classifiers to select retrieval methods. |
| Approach: | They propose a framework that dynamically selects the most suitable retrieval strategy based on query complexity. |
| Outcome: | The proposed framework achieves state-of-the-art results on multiple single-hop and multi-hop datasets while reducing retrieval costs. |
EXIT: Context-Aware Extractive Compression for Enhancing Retrieval-Augmented Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Current retrieval-augmented generation systems struggle when retrieval models fail to rank the most relevant documents . existing extractive methods reduce latency but rely on independent, non-adaptive sentence selection . |
| Approach: | They introduce an extractive context compression framework that enhances retrieval-augmented generation in question answering. |
| Outcome: | EXIT surpasses existing compression methods and uncompressed baselines in QA accuracy . the framework reduces inference time and token count while preserving contextual dependencies . |
How Robust Are Router-LLMs? Analysis of the Fragility of LLM Routing Capabilities (2026.eacl-long)
Copied to clipboard
| Challenge: | Large language model (LLM) routing has emerged as a promising solution to balancing computational costs and performance. |
| Approach: | They propose a framework that categorizes router performance across a broad spectrum of query types . large language models have revolutionized natural language processing . |
| Outcome: | The proposed framework categorizes router performance across a broad spectrum of query types . it integrates privacy and safety assessments to reveal hidden risks . |
Adaptive-RAG: Learning to Adapt Retrieval-Augmented Large Language Models through Question Complexity (2024.naacl-long)
Copied to clipboard
| Challenge: | Recent Large Language Models (LLMs) generate factually incorrect answers based on their parametric memory. |
| Approach: | They propose a retrieval-augmented large language model that can dynamically select the most suitable strategy based on query complexity. |
| Outcome: | The proposed approach improves the performance of QA systems on open-domain QA datasets. |
MultiConIR: Towards Multi-Condition Information Retrieval (2025.findings-emnlp)
Copied to clipboard
Xuan Lu, Sifan Liu, Bochao Yin, Yongqi Li, Xinghao Chen, Hui Su, Yaohui Jin, Wenjun Zeng, Xiaoyu Shen
| Challenge: | MultiConIR is a benchmark designed to evaluate retrieval and reranking models under nuanced multi-condition query scenarios. |
| Approach: | They propose a benchmark to evaluate retrieval and reranking models under nuanced multi-condition query scenarios. |
| Outcome: | The proposed benchmark evaluates retrieval and reranking models under nuanced multi-condition query scenarios across five domains. |
Q-PRM: Adaptive Query Rewriting for Retrieval-Augmented Generation via Step-level Process Supervision (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to rewriting queries often lack supervision signals for intermediate steps . existing approaches rely on outcome-supervised training or heuristic rules to guide the rewrite process . |
| Approach: | They propose a query rewriting framework that generates process-level supervision signals for intermediate steps. |
| Outcome: | a new query rewriting framework outperforms existing approaches on open-domain QA benchmarks. |
UniRAG: A Unified RAG Framework for Knowledge-Intensive Queries with Decomposition, Break-Down Reasoning, and Iterative Rewriting (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing retrieval-augmented generation approaches struggle with query complexity, propagated reasoning errors, or rely on incomplete or noisy retrieval. |
| Approach: | a unified retrieval-augmented generation framework is developed to address query complexity . the framework decomposes queries into semantically coherent sub-queries . it explicitly verifies retrieved sub-facts and adaptively refines queries based on identified knowledge gaps. |
| Outcome: | a new framework improves answer completeness and reliability by decomposing queries into coherent sub-queries . the framework explicitly verifies retrieved sub-facts and adaptively refines queries based on identified knowledge gaps. |
Evaluating NL2SQL via SQL2NL (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing benchmarks do not address robustness to linguistic variation in NL2SQL models . |
| Approach: | They propose a schema-aligned paraphrasing framework that leverages SQL-to-NL to generate semantically equivalent, lexically diverse queries while maintaining alignment with the original schema and intent. |
| Outcome: | The proposed framework generates semantically equivalent, lexically diverse queries while maintaining alignment with the original schema and intent. |
Mixed Signals: Decoding VLMs’ Reasoning and Underlying Bias in Vision-Language Conflict (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Vision-language models have demonstrated impressive performance by effectively integrating visual and textual information to solve complex tasks. |
| Approach: | They build upon existing benchmarks to create five datasets containing mismatched image-text pairs and examine how they reason over visual and textual data . |
| Outcome: | The proposed model reasoned over visual and textual data in real-world applications but not in the visual and visual descriptions. |
GQLBench: A Large-Scale Cross-Domain, Cross-Dialect Benchmark for NL2GQL (2026.acl-long)
Copied to clipboard
| Challenge: | despite growing interest in NL2GQL, benchmarking progress has been constrained by the lack of resources that are simultaneously large-scale, cross-domain, and cross-dialect. |
| Approach: | They propose a framework that integrates NL2SQL-to-NL2GQL conversion with graph-native data generation. |
| Outcome: | The proposed framework supports execution-based evaluation on Cypher and ISO-GQL, covering hundreds of graph databases and over 20k natural language questions for each dialect. |
PACE: Prefix-Protected and Difficulty-Aware Compression for Efficient Reasoning (2026.findings-acl)
Copied to clipboard
Ruixiang Feng, Yuntao Wen, Silin Zhou, Ke Shi, Yifan Wang, Ran Le, Zhenwei An, Zongchao Chen, Chen Yang, Guangyue Peng, Yiming Jia, Dongsheng Wang, Tao Zhang, Lisi Chen, Yang Song, Shen Gao, Shuo Shang
| Challenge: | Existing LRMs often suffer from "overthinking" and excessively long reasoning traces . a dual-level framework for length compression of LRM is proposed . |
| Approach: | They propose a framework for prefix-protected and difficulty-aware compression under hierarchical supervision. |
| Outcome: | The proposed framework reduces token usage while improving accuracy on math benchmarks. |